Point Charges and Polygonal Linkages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mystery of Point Charges

We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in Rn. This question goes back to J. C. Maxwell and M. Morse. Using fewnomial theory we show that for a given number of charges there exists an upper bound independent of the dimension, and show it to be at most 12 for three charges. We conjecture an exact upper bo...

متن کامل

Polygonal Approximation of Point Sets

Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge pixels/voxels in digital images. Polygonal approximation of edge pixels can also be interpreted as groupin...

متن کامل

On the nonradiating motion of point charges

We investigate the possible existence of nonradiating motions of systems of point charges, according to classical electrodynamics with retarded potentials. We prove that two point particles of arbitrary electric charges cannot move for an infinitely long time within a finite region of space without radiating electromagnetic energy. We show however with an example that nonradiating accelerated m...

متن کامل

On the radiationless motion of point charges

We investigate, from the point of view of classical electrodynamics with retarded potentials, the possible existence of nonradiating motions of point charges. We give a rigorous proof of the fact that two point particles of arbitrary electric charges cannot move for arbitrarily long times within a finite region region of space without radiating electromagnetic energy.

متن کامل

Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages

A polygonal linkage or chain is a sequence of segments of fixed lengths, free to turn about their endpoints, which act as joints. This paper reviews some results in chain reconfiguration and highlights several open problems We consider a sequence of closed straight line segments [A0, A1], [A1, A2], . . . [An−1, An] of fixed lengths l1, l2, . . . ln, respectively, imagining that these line segme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamical and Control Systems

سال: 2015

ISSN: 1079-2724,1573-8698

DOI: 10.1007/s10883-015-9286-3